EFFICIENT OVERLAPPED FFT ALGORITHMS FOR HYPERCUBE-CONNECTED MULTICOMPUTERS∗
نویسندگان
چکیده
منابع مشابه
Efficient Overlapped Fft Algorithms for Hypercube-connected Multicomputers
In this work, we propose parallel FFT algorithms, for medium-to-coarse grain hypercubeconnected multicomputers, which are more elegant and efficient than the existing ones. The proposed algorithms achieve perfect load-balance for the efficient simplified-butterfly scheme, minimize the communication overhead by decreasing both the number and the volume of concurrent communications. Communication...
متن کاملEfficient Fast Hartley Transform Algorithms for Hypercube-Connected Multicomputers
Although Fast Hartley Transform (FHT) provides efficient spectral analysis of real discrete signals, the literature that addresses the parallelization of FHT is extremely rare. FHT is a real transformation and does not necessitate any complex arithmetics. On the other hand, FHT algorithm has an irregular computational structure which makes efficient parallelization harder. In this paper, we pro...
متن کاملHypercube Algorithms on Mesh Connected Multicomputers
A new methodology named CALMANT (CC-cube Algorithms on Meshes and Tori) for mapping a kind of algorithms that we call CC-cube algorithm onto multicomputers with hypercube, mesh, or torus interconnection topology is proposed. This methodology is suitable when the initial problem can be expressed as a set of processes that communicate through a hypercube topology (a CC-cube algorithm). There are ...
متن کاملExecuting Algorithms with Hypercube Topology on Torus Multicomputers
Many parallel algorithms use hypercubes as the communication topology among their processes. When such algorithms are executed on hypercube multicomputers the communication cost is kept minimum since processes can be allocated to processors in such a way that only communication between neighbor processors is required. However, the scalability of hypercube multicomputers is constrained by the fa...
متن کاملEfficient Implementation of Barrier Synchronization in Wormhole-Routed Hypercube Multicomputers
This paper addresses eecient implementation of barrier synchronization in wormhole-routed hypercube multicomputers. For those systems supporting only unicast communication in hardware, a novel software tree approach, the U-cube tree, is proposed. An important feature of the U-cube tree is that all messages injected into the network are guaranteed to be contention-free. Performance measurements ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Algorithms and Applications
سال: 1994
ISSN: 1063-7192
DOI: 10.1080/10637199408915457